Quasi-Perfect Lee Codes of Radius 2 and Arbitrarily Large Dimension
نویسندگان
چکیده
منابع مشابه
Quasi-Perfect Lee Codes from Quadratic Curves over Finite Fields
Golomb and Welch conjectured in 1970 that there only exist perfect Lee codes for radius t = 1 or dimension n = 1, 2. It is admitted that the existence and the construction of quasi-perfect Lee codes have to be studied since they are the best alternative to the perfect codes. In this paper we firstly highlight the relationships between subset sums, Cayley graphs, and Lee linear codes and present...
متن کاملHypothesis Testing and Quasi-Perfect Codes
Hypothesis testing lower bounds to the channel coding error probability are studied. For a family of symmetric channels, block lengths and coding rates, the error probability of the best code is shown to coincide with that of a binary hypothesis test with certain parameters. The points in which they coincide, are precisely the points at which perfect or quasi-perfect codes exist. General condit...
متن کاملA family of constacyclic ternary quasi-perfect codes with covering radius 3
In this paper a family of constacyclic ternary quasi-perfect linear block codes is presented. This family extends the result presented in a previous work by the first two authors, where the existence of codes with the presented parameters was stated as an open question. The codes have a minimum distance 5 and covering radius 3.
متن کاملOn the nonexistence of linear perfect Lee codes
In 1968, Golomb and Welch conjectured that there does not exist perfect Lee code in Z with radius r ≥ 2 and dimension n ≥ 3. Besides its own interest in coding theory and discrete geometry, this conjecture is also strongly related to the degree-diameter problems of abelian Cayley graphs. Although there are many papers on this topic, the Golomb-Welch conjecture is far from being solved. In this ...
متن کاملQuasi-perfect codes in the $\ell_p$ metric
We consider quasi-perfect codes in Z over the `p metric, 2 ≤ p <∞. Through a computational approach, we determine all radii for which there are linear quasi-perfect codes for p = 2 and n = 2, 3. Moreover, we study codes with a certain degree of imperfection, a notion that generalizes the quasi-perfect codes. Numerical results concerning the codes with the smallest degree of imperfection are pre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2016
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2016.2517069